public class Driver {

	public static int factorGetter(int number) {
		// We assume all factors are divisible by themselves and 1
		int numOfFactors = 2;
		int highestPossibleFactor = 0;

		highestPossibleFactor = number / 2;

		for (int i = 2; i <= highestPossibleFactor; ++i) {
			if (number % i == 0) {
				++numOfFactors;
			}
		}

		return numOfFactors;
	}

}
